Reactive GRASP for the strip-packing problem

This paper presents a greedy randomized adaptive search procedure (GRASP) for the strip packing problem, which is the problem of placing a set of rectangular pieces into a strip of a given width and infinite length so as to minimize the required length. We investigate several strategies for the constructive and improvement phases and several choices for critical search parameters. We perform extensive computational experiments with wellknown instances which have been previously reported, first to select the best alternatives and then to compare the efficiency of our algorithm with other procedures. The results show that the GRASP algorithm outperforms recently reported metaheuristics.